skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Kritschgau, Jürgen"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, Discrete Mathematics)
    Full Text Available 
  2. ; ; ; (, European Journal of Combinatorics)
    Full Text Available 
  3. ; ; ; ; ; (, Electronic Communications in Probability)
    Full Text Available 
  4. ; ; (, Journal of Combinatorics)
    Full Text Available 
  5. ; ; ; (, Discrete Applied Mathematics)
    Full Text Available 
  6. ; (, Discrete Applied Mathematics)
    Full Text Available 
  7. (, The Electronic Journal of Combinatorics)
    null (Ed.)
    The existence of a rainbow matching given a minimum color degree, proper coloring, or triangle-free host graph has been studied extensively. This paper generalizes these problems to edge colored graphs with given total color degree. In particular, we find that if a graph $$G$$ has total color degree $2mn$ and satisfies some other properties, then $$G$$ contains a matching of size $$m$$. These other properties include $$G$$ being triangle-free, $$C_4$$-free, properly colored, or large enough. 
    more » « less
    Full Text Available